Efficient Algorithms for Morphisms over Omega-Regular Languages
نویسندگان
چکیده
Morphisms to finite semigroups can be used for recognizing omega-regular languages. The socalled strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a trivial complementation procedure. We give a quadratic-time algorithm for computing the syntactic morphism from any given strongly recognizing morphism, thereby showing that minimization is easy as well. In addition, we give algorithms for efficiently solving various decision problems for weakly recognizing morphisms. Weakly recognizing morphism are often smaller than their strongly recognizing counterparts. Finally, we describe the language operations needed for converting formulas in monadic second-order logic (MSO) into strongly recognizing morphisms, and we give some experimental results. 1998 ACM Subject Classification F.4.1 Mathematical Logic; F.4.3 Formal Languages
منابع مشابه
Undecidability in ω-Regular Languages
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word α such that h(α) = g(α). In the general case this problem was shown to be undecidable by K. Ruohonen (1985). Recently, it was proved that the infinite PCP is undecidable already when the domain alphabet of the morphisms co...
متن کاملWhen Does Partial Commutative Closure Preserve Regularity?
The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models of parallelism [14, 15, 16, 22]. We refer the reader to the survey [10, 9] or to the recent articles of Ochmański [17, 18, 19] for further references. In this...
متن کاملEquality sets of prefix morphisms and regular star languages
We consider equality sets of prefix morphisms, that is, sets EG(g1, g2) = {w | g1(w) = g2(w)}, where g1 and g2 are prefix morphisms. Recall that a morphism g is prefix if, for all different letters a and b, g(a) is not a prefix of g(b). We prove a rather surprising equality on families of languages, namely, that the family of regular star languages coincides with the family of languages of form...
متن کاملExtending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the automaton synthesis paradigm for the infinitary languages by presenting an algorithm to learn an arbitrary regular set of infinite sequences (an ω-regular language) over an alphabet Σ. Ou...
متن کاملThe Power of Programs over Monoids in DA
The program-over-monoid model of computation originates with Barrington’s proof that it captures the complexity class NC1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that...
متن کامل